Computing Congruence Lattices of Finite Lattices
نویسنده
چکیده
An inequality between the number of coverings in the ordered set J(Con L) of join irreducible congruences on a lattice L and the size of L is given. Using this inequality it is shown that this ordered set can be computed in time O(n2 log2 n), where n = |L|. This paper is motivated by the problem of efficiently calculating and representing the congruence lattice Con L of a finite lattice L. Of course Con L can be exponential in the size of L; for example, when L is a chain of length n, Con L has 2 elements. However, since Con L is a distributive lattice, it can be recovered easily from the ordered set of its join irreducible elements J(Con L). Indeed any finite distributive lattice D is isomorphic to the lattice of order ideals of J(D) and this lattice is in turn isomorphic to the lattice of all antichains of J(D), where the antichains are ordered by A B, i.e., for each a ∈ A there is a b ∈ B with a ≤ b. If P is an ordered set of size n which has N order ideals, then there are straightforward algorithms to find the order ideals of P which run in time O(nN); see, for example, [5]. In [10] Medina and Nourine give an algorithm which runs in time O(dN), where d is the maximum number of covers of any element of P. Thus we will concentrate on the problem of efficiently finding J(Con L).
منابع مشابه
Distributive lattices with strong endomorphism kernel property as direct sums
Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem 2.8}). We shall determine the structure of special elements (which are introduced after Theorem 2.8 under the name strong elements) and show that these lattices can be considered as a direct product of ...
متن کاملFUZZY CONVEX SUBALGEBRAS OF COMMUTATIVE RESIDUATED LATTICES
In this paper, we define the notions of fuzzy congruence relations and fuzzy convex subalgebras on a commutative residuated lattice and we obtain some related results. In particular, we will show that there exists a one to one correspondence between the set of all fuzzy congruence relations and the set of all fuzzy convex subalgebras on a commutative residuated lattice. Then we study fuzzy...
متن کاملProjective Lattices
such that f(g(a)) = a for all a ∈ L. Projective lattices are characterized in [3] by four conditions. This talk will discuss two of them that are of current interest. If g in (2) is only required to be order-preserving, it is called an isotone section of the epimorphism (1). We will characterize which lattices L have an isotope section for every epimorphism (1). We will use this to characterize...
متن کاملAlgorithms for Finite, Finitely Presented and Free Lattices
In this talk we will present and analyze the efficiency of various algorithms in lattice theory. For finite lattices this will include recognition of various properties such as subdirect irreducibility, semidistributivity, and boundedness (in the sense of McKenzie) as well as efficient algorithms for computing the congruence lattice. For free and finitely presented lattices we will discuss algo...
متن کاملFUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES
The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...
متن کاملCongruence-preserving Extensions of Finite Lattices to Semimodular Lattices
We prove that every finite lattice has a congruence-preserving extension to a finite semimodular lattice.
متن کامل